\begin{problem}{La cucaracha}{cucarach.in}{cucarach.out}{2 seconds}

At every midnight in the flat of scientist Vasya a horror starts. Hundreds\ldots oh no! 
thousands
of cockroaches go out of every hole to his dinner table destroying all crumbs and leavings!

Vasya hates cockroaches. He thought for a very long time and now he keeps 
in his hands a supertrap 
which attracts all cockroaches in its very huge coverage area after activation.

He plans to activate this trap tonight. But there is one problem. This very effective trap
with very huge coverage area consumes very large amounts of energy. So Vasya plans
to minimize the time this trap will work. He collected the data about all points 
the cockroaches enjoy. Also he noticed that all the cockroaches move only on the lines
of his checked table-cloth with a constant speed (we can suppose this speed is equal to 1,
so the cockroach located at one of the junctions can move in one time unit to any
vertically or horizontally adjacent junction). 
Vasya has decided to activate his trap in one of the junctions.
When the trap is activated, all cockroaches will move to the junction containing it as
fast as they can so in any unit of time the cockroach will move to the adjacent junction
maximally decreasing its distance to the trap 
(if there is a tie, the cockroach may select any of the tying junctions).

Write a program for Vasya that will select a junction minimizing the amount of time needed to
destroy all cockroaches.

Of course your program will assume the table-cloth to be the Cartesian plane and the
junctions to be the points with integer coordinates.

\InputFile

The first line of the input file contains the number of cockroaches' meeting points $N$
($1\le N\le 10000$). The next $N$ lines contain $x$ and $y$ coordinates of the points
(integer numbers not greater than $10^9$ by their absolute values).

\OutputFile

You have to write only two integer numbers --- $x$ and $y$ coordinates of a junction that
minimizes the trap work time. If there is more than one solution, output any of them.

\Example

\begin{example}
\exmp{
2
1 1
3 3
}{
2 2
}%
\end{example}

\end{problem}
